Stationary Waiting-Time Distributions for Single-Server Queues
نویسندگان
چکیده
منابع مشابه
stationary single-server queues
This paper complements two previous studies (Daley and Rolski, 1984, 199 1) by indicating the extent to which characteristics of a general stationary point process taken as the arrival process of a single-server queue influence light traffic limit theorems for the two essentially distinct schemes of dilation and thinning as routes to the limit. Properties of both the work-load and the waiting-t...
متن کاملAn Approximation for Performance Evaluation of Stationary Single Server Queues
This paper provides a method for approzimating the probability distributions of stationary statistics in FIFO single server queues. The method is based on the Wiener Hopf factorization technique, and is applied to semi-Markov queues where the underlying state space is of unlimited size. A particularly important case is a model for a statistical multiplezer where the net input process forms a st...
متن کاملOn the Relaxation Time for Single Server Queues
This paper gives a natural definition of the relaxation time for general single server queues. First, we describe a GI/GI/I queue as a limit of GI/GPH/I queues. Each GI/GPH/I queue is transferred to some equivalent bulk arrival GIx/M/I queue, which is formulated by a spatially homogeneous Markov chain with reflecting barrior at zero. An upper bound, which is easy to calculate, of the relaxation...
متن کاملAsymptotic Approximations for Stationary Distributions of Many-server Queues with Abandonment
A many-server queueing system is considered in which customers arrive according to a renewal process, and have service and patience times that are drawn from two independent sequences of independent, identically distributed random variables. Customers enter service in the order of arrival and are assumed to abandon the queue if the waiting time in queue exceeds the patience time. The state Y (N...
متن کاملSome Inequalities for Single Server Queues
The expected wait in the Gi/G/1 queue is related to the mean and variance of the idle time. For arrival distributions which are 1FR or have mean residual life bounded by r-, simple bounds are obtained which A. give, for example, the expected number in queue to within at most one customer. By equating input with output, relations between random variables are used to obtain expressions foi the mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1962
ISSN: 0003-4851
DOI: 10.1214/aoms/1177704365